On the Sum - of - Squares Algorithm for Bin
نویسندگان
چکیده
In this paper we present a theoretical analysis of the deterministic on-line Sum of Squares algorithm (SS) for bin packing, introduced and studied experimentally in [8], along with several new variants. SS is applicable to any instance of bin packing in which the bin capacity B and item sizes s(a) are integral (or can be scaled to be so), and runs in time O(nB). It performs remarkably well from an average case point of view: For any discrete distribution in which the optimal expected waste is sublinear, SS also has sublinear expected waste. For any discrete distribution where the optimal expected waste is bounded, SS has expected waste at most O(log n). In addition, we present a randomized O(nB logB)-time on-line algorithm SS , based on SS, whose expected behavior is essentially optimal for all discrete distributions. Algorithm SS also depends on a new linear-programming-based pseudopolynomial-time algorithm for solving the NP-hard problem of determining, given a discrete distribution F , just what is the growth rate for the optimal expected waste. An o -line randomized variant SS performs well in a worst-case sense: For any list L of integer-sized items to be packed into bins of a xed size B, the expected number of bins used by SS is at most OPT (L) +pOPT (L). [email protected]. Department of Computer Sciences, University of Szeged, Szeged, Hungary. [email protected]. AT&T Labs, Room C239, 180 Park Avenue, Florham Park, NJ 07932, USA. [email protected]. Laboratoire de Recherche en Informatique, Bâtiment 490, Universit e Paris-Sud, 91405 Orsay Cedex, France. [email protected]. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA {[email protected]. AT&T Labs, Room C237, 180 Park Avenue, Florham Park, NJ 07932, USA. [email protected]. Statistical Laboratory, University of Cambridge, Cambridge CB2 1SB, England.
منابع مشابه
An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملOn the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this note, we improve the asymptotic worst case bound to 2.7777 . . .
متن کاملUsing Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover
We show how the on-line bounded-space bin cover problem can be modeled with a Markov chain. We then use this Markov chain formulation to derive an algorithm for the on-line bounded-space bin cover problem. Our algorithm is designed to perform well in a restrictive environment where it can utilize only very few open bins at each time. We analyze the performance of our algorithm and compare it to...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000